HybridMiner: Mining Maximal Frequent Itemsets Using Hybrid Database Representation Approach

摘要

In this paper we present a novel hybrid (arraybased layout and verticalbitmap layout) database representation approach for mining complete MaximalFrequent Itemset (MFI) on sparse and large datasets. Our work is novel in termsof scalability, item search order and two horizontal and vertical projectiontechniques. We also present a maximal algorithm using this hybrid databaserepresentation approach. Different experimental results on real and sparsebenchmark datasets show that our approach is better than previous state of artmaximal algorithms.